Quadruple Time Redundancy Adders
نویسندگان
چکیده
منابع مشابه
Design and Synthesis of High Speed Low Power Signed Digit Adders
Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...
متن کاملUnified Approach to the Design of Modulo-(2 ± 1) Adders Based on Signed-LSB Representation of Residues
Moduli of the form 2 ± 1, which greatly simplify certain arithmetic operations in residue number systems (RNS), have been of longstanding interest. A steady stream of designs for modulo-(2 ± 1) adders has rendered the latency of such adders quite competitive with ordinary adders. The next logical step is to approach the problem in a unified and systematic manner that does not require each desig...
متن کاملA New Efficient Scalable BIST Full Adder using Polymorphic Gates
Among various testing methodologies, Built-in SelfTest (BIST) is recognized as a low cost, effective paradigm. Also, full adders are one of the basic building blocks of most arithmetic circuits in all processing units. In this paper, an optimized testable 2bit full adder as a test building block is proposed. Then, a BIST procedure is introduced to scale up the building block and to generate a s...
متن کاملImplementation and Delay Estimation of Concurrent Error Detection Arithmetic Adders Using Hardware Redundancy Based on Dual Rail Encoding
Arithmetic functions are the most used operations in VLSI circuits. So the design of adders with high reliability and speed operation are of major concern in such circuits. This paper presents a methodology for designing totally self-checking Arithmetic adders for VLSI circuits and FPGA implementation using Verilog HDL. It detects the presence of all single stuck-at faults on-line that may occu...
متن کاملComputational Arrays with Flexible Redundancy
AbstmctDifferent multiple redundancy schemes for fault detection and correction in computational arrays are proposed and analyzed. The basic idea is to embed a logical array of nodes onto a processor/switch array such that d processors, 1 2 d 5 4, are dedicated to the computation associated with each node. The input to a node is directed to the d processors constituting that node, and the outpu...
متن کامل